Robust truss optimization using the sequential parametric convex approximation method
نویسندگان
چکیده
We study the design of robust truss structures under mechanical equilibrium, displacements and stress constraints. Our main objective is to minimize the total amount of material, for the purpose of finding the most economic structure. A robust design is found by considering load perturbations. The nature of the constraints makes the mathematical program nonconvex. In order to solve this problem, we apply the sequential convex approximation method, which deals with the original problem through solving a sequence of differentiable convex ones. Additionally, we show the global convergence of this method using a Slater type hypothesis on the data.
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA HYBRID ALGORITHM FOR SIZING AND LAYOUT OPTIMIZATION OF TRUSS STRUCTURES COMBINING DISCRETE PSO AND CONVEX APPROXIMATION
An efficient method for size and layout optimization of the truss structures is presented in this paper. In order to this, an efficient method by combining an improved discrete particle swarm optimization (IDPSO) and method of moving asymptotes (MMA) is proposed. In the hybrid of IDPSO and MMA, the nodal coordinates defining the layout of the structure are optimized with MMA, and afterwards the...
متن کاملA sequential parametric convex approximation method with applications to nonconvex truss topology design problems
We describe a general scheme for solving nonconvex optimization problems, where in each iteration the nonconvex feasible set is approximated by an inner convex approximation. The latter is defined using an upper bound on the nonconvex constraint functions. Under appropriate conditions on this upper bounding convex function, a monotone convergence to a KKT point is established. The scheme is app...
متن کاملSequential Semidefinite Program for Robust Truss Optimization based on Robustness Functions associated with Stress Constraints
A robust truss optimization scheme, as well as an optimization algorithm, is presented based on the robustness function. Under the uncertainties of external forces based on the info-gap model, the maximization problem of robustness function is formulated as the optimization problem with infinitely many constraint conditions. By using a semidefinite relaxation technique, we reformulate the prese...
متن کاملRobust control under parametric uncertainty via primal-dual convex analysis
A numerical method is proposed for optimal robust control synthesis. The method applies to the case when the coefficients of the characteristic polynomial depend linearly on the uncertain parameters. A primal/dual pair of infinite-dimensional convex problems is solved by successive finite-dimensional approximations. The primal/dual pair has no duality gap, and both upper and lower bounds produc...
متن کامل